Polynomial Combinatorial Algorithms for Skew-bisubmodular Function Minimization
نویسندگان
چکیده
Huber, Krokhin, and Powell (2013) introduced a concept of skew bisubmodularity, as a generalization of bisubmodularity, in their complexity dichotomy theorem for valued constraint satisfaction problems over the three-value domain, and Huber and Krokhin (2014) showed the oracle tractability of minimization of skew-bisubmodular functions. Fujishige, Tanigawa, and Yoshida (2014) also showed a min-max theorem that characterizes the skew-bisubmodular function minimization, but devising a combinatorial polynomial algorithm for skew-bisubmodular function minimization was left open. In the present paper we give first combinatorial (weakly and strongly) polynomial algorithms for skew-bisubmodular function minimization.
منابع مشابه
Bisubmodular Function Minimization
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functions, extending the scaling algorithm for submodular function minimization due to Iwata, Fleischer, and Fujishige. Since the rank functions of delta-matroids are bisubmodular, the scaling algorithm naturally leads to the first combinatorial polynomial algorithm for testing membership in delta-matro...
متن کاملOracle Tractability of Skew Bisubmodular
In this paper we consider skew bisubmodular functions as recently introduced by the authors and Powell. We construct a convex extension of a skew bisubmodular function which we call Lovász extension in correspondence to the submodular case. We use this extension to show that skew bisubmodular functions given by an oracle can be minimised in polynomial time.
متن کاملOracle Tractability of Skew Bisubmodular Functions
A key task in combinatorial optimisation is the minimisation of discrete functions. Important examples are submodular functions, see e. g. [6, 13, 14, 17], and bisubmodular functions, see e. g. [2, 6, 14, 16]. These functions can be viewed as (special) functions from D to R where D is a 2-element set for the submodular case and a 3-element set for the bisubmodular case. Fix a finite set D. One ...
متن کاملImproved Approximation Algorithms for k-Submodular Function Maximization
This paper presents a polynomial-time 1/2-approximation algorithm for maximizing nonnegative k-submodular functions. This improves upon the previous max{1/3, 1/(1+a)}-approximation by Ward and Živný [15], where a = max{1, √ (k − 1)/4}. We also show that for monotone ksubmodular functions there is a polynomial-time k/(2k− 1)-approximation algorithm while for any ε > 0 a ((k + 1)/2k + ε)-approxim...
متن کاملSubmodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular Functions
We introduce a new class of functions that can be minimized in polynomial time in the value oracle model. These are functions f satisfying f(x) + f(y) ≥ f(x ⊓ y) + f(x ⊔ y) where the domain of each variable xi corresponds to nodes of a rooted binary tree, and operations ⊓,⊔ are defined with respect to this tree. Special cases include previously studied L-convex and bisubmodular functions, which...
متن کامل